Quasi-Hamiltonian bookkeeping of WZNW defects
نویسندگان
چکیده
منابع مشابه
The chiral WZNW phase space as a quasi-Poisson space
It is explained that the chiral WZNW phase space is a quasi-Poisson space with respect to the ‘canonical’ Lie quasi-bialgebra which is the classical limit of Drinfeld’s quasi-Hopf deformation of the universal enveloping algebra. This exemplifies the notion of quasi-Poisson-Lie symmetry introduced recently by Alekseev and Kosmann-Schwarzbach. PACS codes: 11.25.Hf, 11.10.Kk, 11.30.Na keywords: WZ...
متن کاملQuasi-Newton Hamiltonian Monte Carlo
The Hamiltonian Monte Carlo (HMC) method has become significantly popular in recent years. It is the state-of-the-art MCMC sampler due to its more efficient exploration to the parameter space than the standard random-walk based proposal. The key idea behind HMC is that it makes use of first-order gradient information about the target distribution. In this paper, we propose a novel dynamics usin...
متن کاملBi–Hamiltonian manifolds, quasi-bi-Hamiltonian systems and separation variables
We discuss from a bi-Hamiltonian point of view the Hamilton–Jacobi separability of a few dynamical systems. They are shown to admit, in their natural phase space, a quasi–bi– Hamiltonian formulation of Pfaffian type. This property allows us to straightforwardly recover a set of separation variables for the corresponding Hamilton–Jacobi equation.
متن کاملStrongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
A semicomplete multipartite or semicomplete c-partite digraph D is a biorientation of a c-partite graph. A semicomplete multipartite digraph D is called strongly quasiHamiltonian-connected, if for any two distinct vertices x and y of D, there is a path P from x to y such that P contains at least one vertex from each partite set of D. In this paper we show that every 4-strong semicomplete multip...
متن کاملFinding Hamiltonian circuits in quasi-adjoint graphs
This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothermic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718–729]. This paper presents a class of digraphs: the quasi-adjoint graphs. This class includes the ones used in the paper cited above. A polynomial recognition alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometry and Physics
سال: 2014
ISSN: 0393-0440
DOI: 10.1016/j.geomphys.2013.10.009